Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...

This paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. A reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. The model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. Fixed points corresponding to cyclic bounding motions are found and calcul...

We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels in a distance-bounding protocol. The optimal threshold will ensure that even if an intruder attempts to cause incorrect authentication, the expected loss the verifier suffers will still be lower than when the intruder do...

We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.

this paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. a reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. the model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. fixed points corresponding to cyclic bounding motions are found and calcul...

We study combinatorial principles weaker than Ramsey’s theorem for pairs over the system RCA0 (Recursive Comprehension Axiom) with Σ2-bounding. It is shown that the principles of Cohesiveness (COH), Ascending and Descending Sequence (ADS), and Chain/Antichain (CAC) are all Π1-conservative over Σ2-bounding. In particular, none of these principles proves Σ 0 2induction.

this paper presents evidence on mesozoic inversion of basin bounding faults within the taleqan-gajereh-lar paleograben (tglp) in central alborz range. for this purpose, well documented stratigraphy data across the tglp together with the new acquired structural data on the geometry and kinematics of the paleograben basin bounding faults are utilized. the tglp has evolved through the early and mi...

Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive bounding information for choosing between different partial solutions during the solution construction process. In this work we present the use of stochastic sampling as a useful alternative to bounding information in cases...

New Bounding Techniques for Channel Codes over Quasi-static Fading Channels. (August 2003) Jingyu Hu, B.E., Shanghai Jiao Tong University, P.R.China Chair of Advisory Committee: Dr. Scott L. Miller This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the...